2D Parallel Constrained Delaunay Mesh Generation: A Multigrain Approach on Deep Multiprocessors
نویسندگان
چکیده
Parallel Constrained Delaunay Mesh (PCDM) is a 2D adaptive and irregular meshing algorithm. In PCDM one can explore concurrency using three different levels of granularity: (i) coarse-grain at the sub-mesh level, (ii) medium-grain at the cavity level and (iii) fine-grain at the element level. The mediumand fine-grain approaches can be used to improve the single-processor performance of coarse-grain PCDM.
منابع مشابه
A multigrain Delaunay mesh generation method for multicore SMT-based architectures
Given the proliferation of layered, multicoreand SMT-based architectures, it is imperative to deploy and evaluate important, multi-level, scientific computing codes, such as meshing algorithms, on these systems. We focus on Parallel Constrained Delaunay Mesh (PCDM) generation. We exploit coarse-grain parallelism at the subdomain level, medium-grain at the cavity level and fine-grain at the elem...
متن کاملAlgorithm TOMS-2006-0003: Parallel 2D Constrained Delaunay Mesh Generation
Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present an algorithm and a software for the parallel constrained Delaunay mesh generation in two dimensions. Our approach is based on the decomposition of the original mesh generation problem into N smaller subproblems which are meshed in parallel. The parallel algorithm ...
متن کاملOptimizing Irregular Adaptive Applications on Multi-threaded Processors: The Case of Medium-Grain Parallel Delaunay Mesh Generation
The Importance of parallel mesh generation and emerging growth of SMT architectures raise an important question of adapting parallel mesh generation software to the SMT architecture. In this work we focus on Parallel Constrained Delaunay Mesh Generation. We explore medium grain parallelism at the sub-domain level. This parallel approach targets commercially available SMT processors. Our goal is...
متن کاملConstrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery
In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments that constrain the edges of the triangulation, while still maintaining most of the favorable properties of ordinary Delaunay triangulations (such as maximizing the minimum angle). CDTs solve the problem of enforcing boundary conformity—ensuring that triangulation edges cover the boundaries (both interior an...
متن کاملTriangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
A b s t r a c t . Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement algorithm for quality mesh generation. Several implementation issues are discussed, including the choice of triangulation algorithms and data structures, the effect of several variants of the Delaunay refinement algorithm on mesh quality, and the use of a...
متن کامل